TSTP Solution File: NUM736^1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : NUM736^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 08:42:06 EDT 2024

% Result   : Theorem 0.20s 0.40s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   40 (  12 unt;  19 typ;   0 def)
%            Number of atoms       :  219 (  21 equ;   0 cnn)
%            Maximal formula atoms :    3 (  10 avg)
%            Number of connectives :   18 (   8   ~;   7   |;   0   &;   0   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   26 (  25   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   19 (  16 usr;   4 con; 0-6 aty)
%            Number of variables   :   21 (   0   ^  15   !;   0   ?;  21   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    frac: $tType ).

thf(type_def_6,type,
    nat: $tType ).

thf(type_def_7,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    frac: $tType ).

thf(func_def_1,type,
    x: frac ).

thf(func_def_2,type,
    y: frac ).

thf(func_def_3,type,
    nat: $tType ).

thf(func_def_4,type,
    more: nat > nat > $o ).

thf(func_def_5,type,
    ts: nat > nat > nat ).

thf(func_def_6,type,
    num: frac > nat ).

thf(func_def_7,type,
    den: frac > nat ).

thf(func_def_9,type,
    less: nat > nat > $o ).

thf(func_def_13,type,
    kCOMB: 
      !>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).

thf(func_def_14,type,
    bCOMB: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).

thf(func_def_15,type,
    vAND: $o > $o > $o ).

thf(func_def_16,type,
    vOR: $o > $o > $o ).

thf(func_def_17,type,
    vIMP: $o > $o > $o ).

thf(func_def_18,type,
    vNOT: $o > $o ).

thf(func_def_19,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(f62,plain,
    $false,
    inference(subsumption_resolution,[],[f61,f15]) ).

thf(f15,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))) != $true,
    inference(cnf_transformation,[],[f13]) ).

thf(f13,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))) != $true,
    inference(flattening,[],[f8]) ).

thf(f8,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))) != $true,
    inference(fool_elimination,[],[f7]) ).

thf(f7,plain,
    ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))),
    inference(rectify,[],[f4]) ).

thf(f4,negated_conjecture,
    ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))),
    inference(negated_conjecture,[],[f3]) ).

thf(f3,conjecture,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz42) ).

thf(f61,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))) = $true,
    inference(trivial_inequality_removal,[],[f56]) ).

thf(f56,plain,
    ( ( $true = $false )
    | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))) = $true ) ),
    inference(superposition,[],[f17,f47]) ).

thf(f47,plain,
    ! [X0: nat,X1: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) = $true )
      | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) = $false ) ),
    inference(trivial_inequality_removal,[],[f46]) ).

thf(f46,plain,
    ! [X0: nat,X1: nat] :
      ( ( $true != $true )
      | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) = $true )
      | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) = $false ) ),
    inference(superposition,[],[f16,f6]) ).

thf(f6,plain,
    ! [X0: $o] :
      ( ( $true = X0 )
      | ( $false = X0 ) ),
    introduced(fool_axiom,[]) ).

thf(f16,plain,
    ! [X0: nat,X1: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) != $true )
      | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) = $true ) ),
    inference(cnf_transformation,[],[f14]) ).

thf(f14,plain,
    ! [X0: nat,X1: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) = $true )
      | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) != $true ) ),
    inference(ennf_transformation,[],[f10]) ).

thf(f10,plain,
    ! [X0: nat,X1: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) = $true )
     => ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) = $true ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f9,plain,
    ! [X0: nat,X1: nat] :
      ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1)
     => vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) ),
    inference(rectify,[],[f2]) ).

thf(f2,axiom,
    ! [X0: nat,X1: nat] :
      ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1)
     => vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz11) ).

thf(f17,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))) = $true,
    inference(cnf_transformation,[],[f12]) ).

thf(f12,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))) = $true,
    inference(fool_elimination,[],[f11]) ).

thf(f11,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,x)),vAPP(frac,nat,den,y))),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),ts,vAPP(frac,nat,num,y)),vAPP(frac,nat,den,x))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15  % Problem    : NUM736^1 : TPTP v8.1.2. Released v3.7.0.
% 0.07/0.16  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.38  % Computer : n024.cluster.edu
% 0.14/0.38  % Model    : x86_64 x86_64
% 0.14/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38  % Memory   : 8042.1875MB
% 0.14/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38  % CPULimit   : 300
% 0.14/0.38  % WCLimit    : 300
% 0.14/0.38  % DateTime   : Fri May  3 14:45:08 EDT 2024
% 0.14/0.38  % CPUTime    : 
% 0.14/0.38  % (22185)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.40  % (22187)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.20/0.40  % (22191)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.20/0.40  % (22188)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.20/0.40  % (22190)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.20/0.40  % (22189)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.20/0.40  % (22186)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.20/0.40  % (22192)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.20/0.40  % (22188)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.40  % (22189)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.40  % Exception at run slice level
% 0.20/0.40  % Exception at run slice level
% 0.20/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.40  % Exception at run slice level
% 0.20/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs% Exception at run slice level
% 0.20/0.40  
% 0.20/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.40  % (22191)First to succeed.
% 0.20/0.40  % (22190)Also succeeded, but the first one will report.
% 0.20/0.40  % (22188)Also succeeded, but the first one will report.
% 0.20/0.40  % (22191)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22185"
% 0.20/0.40  % (22191)Refutation found. Thanks to Tanya!
% 0.20/0.40  % SZS status Theorem for theBenchmark
% 0.20/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.40  % (22191)------------------------------
% 0.20/0.40  % (22191)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.40  % (22191)Termination reason: Refutation
% 0.20/0.40  
% 0.20/0.40  % (22191)Memory used [KB]: 761
% 0.20/0.40  % (22191)Time elapsed: 0.005 s
% 0.20/0.40  % (22191)Instructions burned: 6 (million)
% 0.20/0.40  % (22185)Success in time 0.03 s
%------------------------------------------------------------------------------